Theory of computation

Results: 2087



#Item
221Graph connectivity / Graph theory / Vertex / Connected component / RochaThatte cycle detection algorithm / K-connectivity certificate

Computation and Communication Efficient Graph Processing with Distributed Immutable View Rong Chen†, Xin Ding†, Peng Wang†, Haibo Chen†, Binyu Zang†, Haibing Guan§ Shanghai Key Laboratory of Scalable Computing

Add to Reading List

Source URL: ipads.se.sjtu.edu.cn

Language: English - Date: 2014-06-17 12:26:23
222Computability theory / Model theory / Logic / Mathematics / Theory of computation / Alan Turing / Constructivism / Philosophy of mathematics / Computable model theory / Turing degree / Enumeration / Mathematical logic

Separating the Degree Spectra of Structures Tyler John Markkanen, Ph.D. University of Connecticut, 2009 In computable model theory, mathematical structures are studied on the basis of

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2009-06-07 10:47:50
223Computability theory / Theory of computation / Computable number / Computable function / 01 class / Computation in the limit

ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-10-09 14:07:43
224Computability theory / Constructivism / Theory of computation / Computable analysis / Mathematics / Logic / Computable number / Realizability / Academia / Computable measure theory

15 > 17 JUNE http://cca-net.de anfiteatro -1.A, Faculdade de Economia

Add to Reading List

Source URL: cca-net.de

Language: English - Date: 2016-05-26 12:34:11
225Computability theory / Mathematical logic / Mathematics / Theoretical computer science / Theory of computation / Computable function / Primitive recursive function / operator / Language identification in the limit / Sequence / Arithmetical hierarchy / Cauchy sequence

Fluctuations, effective learnability and metastability in analysis Ulrich Kohlenbach, Pavol Safarik Department of Mathematics, Technische Universit¨ at Darmstadt, Schlossgartenstraße 7, 64289 Darmstadt, Germany

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2013-05-10 05:50:36
226Computability theory / Mathematical logic / Proof theory / Theory of computation / Logic in computer science / Computable function / Reverse mathematics / PA degree / Peano axioms

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-10-26 09:24:01
227Computational complexity theory / Theory of computation / Exponential time hypothesis / Time complexity / NC / Gadget

Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014 Abstract

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:46:32
228Computability theory / Computable function / Computation in the limit / Second-order arithmetic / Compactness theorem / Reverse mathematics / 01 class / PA degree / Low / Algorithmically random sequence / Computable number

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-02-08 07:56:59
229Computability theory / Theory of computation / Mathematics / Theoretical computer science / Mathematical analysis / Computable function / Sigma-algebra / Generalised Whitehead product

Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-01-27 11:28:33
230Theory of computation / Construction / Real estate / Mosaic / Building materials / Floors / Bin / Time complexity / L / Tile / DNA nanotechnology

Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues

Add to Reading List

Source URL: www.eecs.tufts.edu

Language: English - Date: 2007-06-11 16:33:36
UPDATE